<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.6"/>
<title>SystemSharp: SystemSharp.TreeAlgorithms.TreeOperations Class Reference</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript">
  $(document).ready(initResizable);
  $(window).load(resizeHeight);
</script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/javascript">
  $(document).ready(function() { searchBox.OnSelectItem(0); });
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td id="projectlogo"><img alt="Logo" src="logo.png"/></td>
  <td style="padding-left: 0.5em;">
   <div id="projectname">SystemSharp
   &#160;<span id="projectnumber">0.3</span>
   </div>
   <div id="projectbrief">A system-level modeling framework for designing real-time embedded systems</div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.6 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
  <div id="navrow1" class="tabs">
    <ul class="tablist">
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="namespaces.html"><span>Packages</span></a></li>
      <li class="current"><a href="annotated.html"><span>Classes</span></a></li>
      <li><a href="files.html"><span>Files</span></a></li>
      <li>
        <div id="MSearchBox" class="MSearchBoxInactive">
        <span class="left">
          <img id="MSearchSelect" src="search/mag_sel.png"
               onmouseover="return searchBox.OnSearchSelectShow()"
               onmouseout="return searchBox.OnSearchSelectHide()"
               alt=""/>
          <input type="text" id="MSearchField" value="Search" accesskey="S"
               onfocus="searchBox.OnSearchFieldFocus(true)" 
               onblur="searchBox.OnSearchFieldFocus(false)" 
               onkeyup="searchBox.OnSearchFieldChange(event)"/>
          </span><span class="right">
            <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
          </span>
        </div>
      </li>
    </ul>
  </div>
  <div id="navrow2" class="tabs2">
    <ul class="tablist">
      <li><a href="annotated.html"><span>Class&#160;List</span></a></li>
      <li><a href="classes.html"><span>Class&#160;Index</span></a></li>
      <li><a href="hierarchy.html"><span>Class&#160;Hierarchy</span></a></li>
      <li><a href="functions.html"><span>Class&#160;Members</span></a></li>
    </ul>
  </div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
  <div id="nav-tree">
    <div id="nav-tree-contents">
      <div id="nav-sync" class="sync"></div>
    </div>
  </div>
  <div id="splitbar" style="-moz-user-select:none;" 
       class="ui-resizable-handle">
  </div>
</div>
<script type="text/javascript">
$(document).ready(function(){initNavTree('class_system_sharp_1_1_tree_algorithms_1_1_tree_operations.html','');});
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
<a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(0)"><span class="SelectionMark">&#160;</span>All</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(1)"><span class="SelectionMark">&#160;</span>Classes</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(2)"><span class="SelectionMark">&#160;</span>Namespaces</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(3)"><span class="SelectionMark">&#160;</span>Files</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(4)"><span class="SelectionMark">&#160;</span>Functions</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(5)"><span class="SelectionMark">&#160;</span>Variables</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(6)"><span class="SelectionMark">&#160;</span>Typedefs</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(7)"><span class="SelectionMark">&#160;</span>Enumerations</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(8)"><span class="SelectionMark">&#160;</span>Enumerator</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(9)"><span class="SelectionMark">&#160;</span>Properties</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(10)"><span class="SelectionMark">&#160;</span>Events</a></div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0" 
        name="MSearchResults" id="MSearchResults">
</iframe>
</div>

<div class="header">
  <div class="summary">
<a href="#nested-classes">Classes</a> &#124;
<a href="#pub-static-methods">Static Public Member Functions</a> &#124;
<a href="class_system_sharp_1_1_tree_algorithms_1_1_tree_operations-members.html">List of all members</a>  </div>
  <div class="headertitle">
<div class="title">SystemSharp.TreeAlgorithms.TreeOperations Class Reference</div>  </div>
</div><!--header-->
<div class="contents">

<p>This static class provides extension methods to simplify the usage of property maps.  
 <a href="class_system_sharp_1_1_tree_algorithms_1_1_tree_operations.html#details">More...</a></p>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-static-methods"></a>
Static Public Member Functions</h2></td></tr>
<tr class="memitem:ae7b3939ad3b687dd82d33190475e8371"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="class_system_sharp_1_1_tree_algorithms_1_1_tree_operations.html#ae7b3939ad3b687dd82d33190475e8371">RequireAccess&lt; TThis, TValue &gt;</a> (this IPropMap&lt; TThis, TValue &gt; pmap, <a class="el" href="namespace_system_sharp_1_1_tree_algorithms.html#a6a1436f9b943edaf1ab43d5a5df6d004">EAccess</a> access)</td></tr>
<tr class="memdesc:ae7b3939ad3b687dd82d33190475e8371"><td class="mdescLeft">&#160;</td><td class="mdescRight">Checks whether the property map grants the requested access privilege and throws an exception if it doesn't.  <a href="#ae7b3939ad3b687dd82d33190475e8371">More...</a><br/></td></tr>
<tr class="separator:ae7b3939ad3b687dd82d33190475e8371"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a1eadc8c2956caf39c9221edfe2dcac07"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="class_system_sharp_1_1_tree_algorithms_1_1_tree_operations.html#a1eadc8c2956caf39c9221edfe2dcac07">Reset&lt; TThis, TValue &gt;</a> (this IPropMap&lt; TThis, TValue &gt; pmap, IEnumerable&lt; TThis &gt; nodes, TValue value)</td></tr>
<tr class="memdesc:a1eadc8c2956caf39c9221edfe2dcac07"><td class="mdescLeft">&#160;</td><td class="mdescRight">Sets all specified keys of the property map to the specified reset value.  <a href="#a1eadc8c2956caf39c9221edfe2dcac07">More...</a><br/></td></tr>
<tr class="separator:a1eadc8c2956caf39c9221edfe2dcac07"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae27da9f599c50814e87c355e90455706"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="class_system_sharp_1_1_tree_algorithms_1_1_tree_operations.html#ae27da9f599c50814e87c355e90455706">Clear&lt; TThis, TValue &gt;</a> (this IPropMap&lt; TThis, TValue &gt; pmap, IEnumerable&lt; TThis &gt; nodes)</td></tr>
<tr class="memdesc:ae27da9f599c50814e87c355e90455706"><td class="mdescLeft">&#160;</td><td class="mdescRight">Sets all specified keys of the property map to <code>default(TValue)</code>.  <a href="#ae27da9f599c50814e87c355e90455706">More...</a><br/></td></tr>
<tr class="separator:ae27da9f599c50814e87c355e90455706"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a2e624bf3a57ed8622a59cbf5af429c42"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="class_system_sharp_1_1_tree_algorithms_1_1_tree_operations.html#a2e624bf3a57ed8622a59cbf5af429c42">CreateDefaultTempStorage&lt; T &gt;</a> (this IGraphAdapter&lt; T &gt; a, IEnumerable&lt; T &gt; nodes)</td></tr>
<tr class="memdesc:a2e624bf3a57ed8622a59cbf5af429c42"><td class="mdescLeft">&#160;</td><td class="mdescRight">Creates a new list for each temporary list storage property.  <a href="#a2e624bf3a57ed8622a59cbf5af429c42">More...</a><br/></td></tr>
<tr class="separator:a2e624bf3a57ed8622a59cbf5af429c42"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a264e50c23ab43bc5980e80dd9d129d83"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="class_system_sharp_1_1_tree_algorithms_1_1_tree_operations.html#a264e50c23ab43bc5980e80dd9d129d83">InvertRelation&lt; T &gt;</a> (this IGraphAdapter&lt; T &gt; a, IPropMap&lt; T, T &gt; srcrel, IPropMap&lt; T, T[]&gt; dstrel, IEnumerable&lt; T &gt; nodes)</td></tr>
<tr class="memdesc:a264e50c23ab43bc5980e80dd9d129d83"><td class="mdescLeft">&#160;</td><td class="mdescRight">Inverts a property map-based relation.  <a href="#a264e50c23ab43bc5980e80dd9d129d83">More...</a><br/></td></tr>
<tr class="separator:a264e50c23ab43bc5980e80dd9d129d83"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:af536d2d1a3a116676e9fea1ce91d5c22"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="class_system_sharp_1_1_tree_algorithms_1_1_tree_operations.html#af536d2d1a3a116676e9fea1ce91d5c22">InvertRelation&lt; T &gt;</a> (this IGraphAdapter&lt; T &gt; a, IPropMap&lt; T, T[]&gt; srcrel, IPropMap&lt; T, T[]&gt; dstrel, IEnumerable&lt; T &gt; nodes)</td></tr>
<tr class="memdesc:af536d2d1a3a116676e9fea1ce91d5c22"><td class="mdescLeft">&#160;</td><td class="mdescRight">Inverts a property map-based relation.  <a href="#af536d2d1a3a116676e9fea1ce91d5c22">More...</a><br/></td></tr>
<tr class="separator:af536d2d1a3a116676e9fea1ce91d5c22"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae409eb2323b5f5d51d555132c769ce5f"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="class_system_sharp_1_1_tree_algorithms_1_1_tree_operations.html#ae409eb2323b5f5d51d555132c769ce5f">ComputeSuccessorsFromParent&lt; T &gt;</a> (this IGraphAdapter&lt; T &gt; a, IEnumerable&lt; T &gt; nodes)</td></tr>
<tr class="memdesc:ae409eb2323b5f5d51d555132c769ce5f"><td class="mdescLeft">&#160;</td><td class="mdescRight">Inverts a parent relation, taking the successor relation as target.  <a href="#ae409eb2323b5f5d51d555132c769ce5f">More...</a><br/></td></tr>
<tr class="separator:ae409eb2323b5f5d51d555132c769ce5f"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a3affcff37870aae491a1e0a652e442b6"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="class_system_sharp_1_1_tree_algorithms_1_1_tree_operations.html#a3affcff37870aae491a1e0a652e442b6">ComputePredecessorsFromSuccessors&lt; T &gt;</a> (this IGraphAdapter&lt; T &gt; a, IEnumerable&lt; T &gt; nodes)</td></tr>
<tr class="memdesc:a3affcff37870aae491a1e0a652e442b6"><td class="mdescLeft">&#160;</td><td class="mdescRight">Inverts a successor relation, taking the predecessor relation as target.  <a href="#a3affcff37870aae491a1e0a652e442b6">More...</a><br/></td></tr>
<tr class="separator:a3affcff37870aae491a1e0a652e442b6"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ab742b382c2eb84bc70e05072433e88f7"><td class="memItemLeft" align="right" valign="top">static T[]&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="class_system_sharp_1_1_tree_algorithms_1_1_tree_operations.html#ab742b382c2eb84bc70e05072433e88f7">GetPreOrder&lt; T &gt;</a> (this IGraphAdapter&lt; T &gt; a, IList&lt; T &gt; nodes, T start)</td></tr>
<tr class="memdesc:ab742b382c2eb84bc70e05072433e88f7"><td class="mdescLeft">&#160;</td><td class="mdescRight">Performs a depth-first search on the successor relation, updating the pre-order index and pre-order last index relations of the graph adapter.  <a href="#ab742b382c2eb84bc70e05072433e88f7">More...</a><br/></td></tr>
<tr class="separator:ab742b382c2eb84bc70e05072433e88f7"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa1b2c48d35aa188ac914a0096e8e605f"><td class="memItemLeft" align="right" valign="top">static T[]&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="class_system_sharp_1_1_tree_algorithms_1_1_tree_operations.html#aa1b2c48d35aa188ac914a0096e8e605f">GetPreOrder&lt; T &gt;</a> (this IGraphAdapter&lt; T &gt; a, IList&lt; T &gt; nodes)</td></tr>
<tr class="memdesc:aa1b2c48d35aa188ac914a0096e8e605f"><td class="mdescLeft">&#160;</td><td class="mdescRight">Performs a depth-first search on the successor relation, updating the pre-order index and pre-order last index relations of the graph adapter. All nodes without parent are taken as start nodes.  <a href="#aa1b2c48d35aa188ac914a0096e8e605f">More...</a><br/></td></tr>
<tr class="separator:aa1b2c48d35aa188ac914a0096e8e605f"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aaf9124d675ae402b5ae159ee1d9562ca"><td class="memItemLeft" align="right" valign="top">static T[]&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="class_system_sharp_1_1_tree_algorithms_1_1_tree_operations.html#aaf9124d675ae402b5ae159ee1d9562ca">GetPostOrder&lt; T &gt;</a> (IPropMap&lt; T, T[]&gt; succrel, IPropMap&lt; T, int &gt; indexMap, IList&lt; T &gt; nodes, T start, bool reverse)</td></tr>
<tr class="memdesc:aaf9124d675ae402b5ae159ee1d9562ca"><td class="mdescLeft">&#160;</td><td class="mdescRight">Performs a depth-first search on the graph and retrieves a post-order sorting.  <a href="#aaf9124d675ae402b5ae159ee1d9562ca">More...</a><br/></td></tr>
<tr class="separator:aaf9124d675ae402b5ae159ee1d9562ca"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a4bd65ffbbadb4eedaae40cec64276ad1"><td class="memItemLeft" align="right" valign="top">static bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="class_system_sharp_1_1_tree_algorithms_1_1_tree_operations.html#a4bd65ffbbadb4eedaae40cec64276ad1">IsAncestor&lt; T &gt;</a> (IPropMap&lt; T, int &gt; indexrel, IPropMap&lt; T, T &gt; lastrel, T w, T v)</td></tr>
<tr class="memdesc:a4bd65ffbbadb4eedaae40cec64276ad1"><td class="mdescLeft">&#160;</td><td class="mdescRight">Returns <code>true</code> if <em>w</em>  is an ancestor of <code>v</code>.  <a href="#a4bd65ffbbadb4eedaae40cec64276ad1">More...</a><br/></td></tr>
<tr class="separator:a4bd65ffbbadb4eedaae40cec64276ad1"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:accca9c1ccf11f560b1741277be1975f8"><td class="memItemLeft" align="right" valign="top">static bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="class_system_sharp_1_1_tree_algorithms_1_1_tree_operations.html#accca9c1ccf11f560b1741277be1975f8">IsAncestor&lt; T &gt;</a> (this IGraphAdapter&lt; T &gt; a, T w, T v)</td></tr>
<tr class="memdesc:accca9c1ccf11f560b1741277be1975f8"><td class="mdescLeft">&#160;</td><td class="mdescRight">Returns <code>true</code> if <em>w</em>  is an ancestor of <code>v</code>.  <a href="#accca9c1ccf11f560b1741277be1975f8">More...</a><br/></td></tr>
<tr class="separator:accca9c1ccf11f560b1741277be1975f8"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a062ae42f6097aa7767a35fc56a41d9b8"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="class_system_sharp_1_1_tree_algorithms_1_1_tree_operations.html#a062ae42f6097aa7767a35fc56a41d9b8">AnalyzeLoops&lt; T &gt;</a> (this IGraphAdapter&lt; T &gt; a, IList&lt; T &gt; nodes, T start)</td></tr>
<tr class="memdesc:a062ae42f6097aa7767a35fc56a41d9b8"><td class="mdescLeft">&#160;</td><td class="mdescRight">Determines the loop nesting structure of the given (control-flow) graph.  <a href="#a062ae42f6097aa7767a35fc56a41d9b8">More...</a><br/></td></tr>
<tr class="separator:a062ae42f6097aa7767a35fc56a41d9b8"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a7f3cae6dcdf2649c80e1016ef40b863c"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="class_system_sharp_1_1_tree_algorithms_1_1_tree_operations.html#a7f3cae6dcdf2649c80e1016ef40b863c">ComputeImmediateDominators&lt; T &gt;</a> (IPropMap&lt; T, T[]&gt; succrel, IPropMap&lt; T, T[]&gt; predrel, IPropMap&lt; T, int &gt; index, IPropMap&lt; T, T &gt; dom, IList&lt; T &gt; nodes, T start)</td></tr>
<tr class="memdesc:a7f3cae6dcdf2649c80e1016ef40b863c"><td class="mdescLeft">&#160;</td><td class="mdescRight">Computes the immediate dominators of the specified graph nodes.  <a href="#a7f3cae6dcdf2649c80e1016ef40b863c">More...</a><br/></td></tr>
<tr class="separator:a7f3cae6dcdf2649c80e1016ef40b863c"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a5b97968e46c9f611b6867205c9230361"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="class_system_sharp_1_1_tree_algorithms_1_1_tree_operations.html#a5b97968e46c9f611b6867205c9230361">ComputeImmediateDominators&lt; T &gt;</a> (this IGraphAdapter&lt; T &gt; a, IList&lt; T &gt; nodes, T entry)</td></tr>
<tr class="memdesc:a5b97968e46c9f611b6867205c9230361"><td class="mdescLeft">&#160;</td><td class="mdescRight">Computes a the immediate dominators of all specified graph nodes.  <a href="#a5b97968e46c9f611b6867205c9230361">More...</a><br/></td></tr>
<tr class="separator:a5b97968e46c9f611b6867205c9230361"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a8a496b0f86e71a02eddbcfe4214c0322"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="class_system_sharp_1_1_tree_algorithms_1_1_tree_operations.html#a8a496b0f86e71a02eddbcfe4214c0322">GetLCATree&lt; T &gt;</a> (IEnumerable&lt; T &gt; nodes, IPropMap&lt; T, T &gt; prel, T root, IPropMap&lt; T, int &gt; porel, IPropMap&lt; T, T &gt; lprel)</td></tr>
<tr class="memdesc:a8a496b0f86e71a02eddbcfe4214c0322"><td class="mdescLeft">&#160;</td><td class="mdescRight">Computes the lowest common ancestor tree of any set of given nodes.  <a href="#a8a496b0f86e71a02eddbcfe4214c0322">More...</a><br/></td></tr>
<tr class="separator:a8a496b0f86e71a02eddbcfe4214c0322"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>This static class provides extension methods to simplify the usage of property maps. </p>

<p>Definition at line <a class="el" href="_tree_algorithms_8cs_source.html#l00599">599</a> of file <a class="el" href="_tree_algorithms_8cs_source.html">TreeAlgorithms.cs</a>.</p>
</div><h2 class="groupheader">Member Function Documentation</h2>
<a class="anchor" id="a062ae42f6097aa7767a35fc56a41d9b8"></a>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">static void SystemSharp.TreeAlgorithms.TreeOperations.AnalyzeLoops&lt; T &gt; </td>
          <td>(</td>
          <td class="paramtype">this IGraphAdapter&lt; T &gt;&#160;</td>
          <td class="paramname"><em>a</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">IList&lt; T &gt;&#160;</td>
          <td class="paramname"><em>nodes</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">T&#160;</td>
          <td class="paramname"><em>start</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">static</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Determines the loop nesting structure of the given (control-flow) graph. </p>
<p>This is an implementation of Paul Havlak's loop analysis algorithm. Reference: ACM Transactions on Programming Languages and Systems, Vol. 19, No. 4, July 1997, Pages 557-567. </p>
<dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramname">a</td><td>graph adapter</td></tr>
    <tr><td class="paramname">nodes</td><td>nodes to consider</td></tr>
    <tr><td class="paramname">start</td><td>entry node</td></tr>
  </table>
  </dd>
</dl>

<p>Definition at line <a class="el" href="_tree_algorithms_8cs_source.html#l00916">916</a> of file <a class="el" href="_tree_algorithms_8cs_source.html">TreeAlgorithms.cs</a>.</p>

</div>
</div>
<a class="anchor" id="ae27da9f599c50814e87c355e90455706"></a>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">static void SystemSharp.TreeAlgorithms.TreeOperations.Clear&lt; TThis, TValue &gt; </td>
          <td>(</td>
          <td class="paramtype">this IPropMap&lt; TThis, TValue &gt;&#160;</td>
          <td class="paramname"><em>pmap</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">IEnumerable&lt; TThis &gt;&#160;</td>
          <td class="paramname"><em>nodes</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">static</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Sets all specified keys of the property map to <code>default(TValue)</code>. </p>
<dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramname">pmap</td><td>the property map</td></tr>
    <tr><td class="paramname">nodes</td><td>the elements whose property values are to be reset</td></tr>
  </table>
  </dd>
</dl>

<p>Definition at line <a class="el" href="_tree_algorithms_8cs_source.html#l00675">675</a> of file <a class="el" href="_tree_algorithms_8cs_source.html">TreeAlgorithms.cs</a>.</p>

</div>
</div>
<a class="anchor" id="a7f3cae6dcdf2649c80e1016ef40b863c"></a>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">static void SystemSharp.TreeAlgorithms.TreeOperations.ComputeImmediateDominators&lt; T &gt; </td>
          <td>(</td>
          <td class="paramtype">IPropMap&lt; T, T[]&gt;&#160;</td>
          <td class="paramname"><em>succrel</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">IPropMap&lt; T, T[]&gt;&#160;</td>
          <td class="paramname"><em>predrel</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">IPropMap&lt; T, int &gt;&#160;</td>
          <td class="paramname"><em>index</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">IPropMap&lt; T, T &gt;&#160;</td>
          <td class="paramname"><em>dom</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">IList&lt; T &gt;&#160;</td>
          <td class="paramname"><em>nodes</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">T&#160;</td>
          <td class="paramname"><em>start</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">static</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Computes the immediate dominators of the specified graph nodes. </p>
<p>This is an algorithm from Cooper, Harvey and Kennedy for the computation of immediate dominators in a control flow graph. Reference: </p>
<p>SOFTWARE—PRACTICE AND EXPERIENCE 2001; 4:1–10 </p>
<p>Keith D. Cooper, Timothy J. Harvey and Ken Kennedy </p>
<p>A Simple, Fast Dominance Algorithm </p>
<dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramname">succrel</td><td>successor relation</td></tr>
    <tr><td class="paramname">predrel</td><td>predecessor relation</td></tr>
    <tr><td class="paramname">index</td><td>node index map</td></tr>
    <tr><td class="paramname">dom</td><td>immediate dominators relation</td></tr>
    <tr><td class="paramname">nodes</td><td>nodes to consider</td></tr>
    <tr><td class="paramname">start</td><td>start node</td></tr>
  </table>
  </dd>
</dl>
<div class="typeconstraint">
<dl><dt><b>Type Constraints</b></dt><dd>
<table border="0" cellspacing="2" cellpadding="0">
<tr><td valign="top"><em>T</em></td><td>&#160;:</td><td valign="top"><em>class</em></td><td>&#160;</td></tr>
</table>
</dl>
</div>

<p>Definition at line <a class="el" href="_tree_algorithms_8cs_source.html#l01019">1019</a> of file <a class="el" href="_tree_algorithms_8cs_source.html">TreeAlgorithms.cs</a>.</p>

</div>
</div>
<a class="anchor" id="a5b97968e46c9f611b6867205c9230361"></a>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">static void SystemSharp.TreeAlgorithms.TreeOperations.ComputeImmediateDominators&lt; T &gt; </td>
          <td>(</td>
          <td class="paramtype">this IGraphAdapter&lt; T &gt;&#160;</td>
          <td class="paramname"><em>a</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">IList&lt; T &gt;&#160;</td>
          <td class="paramname"><em>nodes</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">T&#160;</td>
          <td class="paramname"><em>entry</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">static</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Computes a the immediate dominators of all specified graph nodes. </p>
<dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramname">a</td><td>graph adapter</td></tr>
    <tr><td class="paramname">nodes</td><td>nodes to consider</td></tr>
    <tr><td class="paramname">entry</td><td>entry node</td></tr>
  </table>
  </dd>
</dl>
<div class="typeconstraint">
<dl><dt><b>Type Constraints</b></dt><dd>
<table border="0" cellspacing="2" cellpadding="0">
<tr><td valign="top"><em>T</em></td><td>&#160;:</td><td valign="top"><em>class</em></td><td>&#160;</td></tr>
</table>
</dl>
</div>

<p>Definition at line <a class="el" href="_tree_algorithms_8cs_source.html#l01081">1081</a> of file <a class="el" href="_tree_algorithms_8cs_source.html">TreeAlgorithms.cs</a>.</p>

</div>
</div>
<a class="anchor" id="a3affcff37870aae491a1e0a652e442b6"></a>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">static void SystemSharp.TreeAlgorithms.TreeOperations.ComputePredecessorsFromSuccessors&lt; T &gt; </td>
          <td>(</td>
          <td class="paramtype">this IGraphAdapter&lt; T &gt;&#160;</td>
          <td class="paramname"><em>a</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">IEnumerable&lt; T &gt;&#160;</td>
          <td class="paramname"><em>nodes</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">static</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Inverts a successor relation, taking the predecessor relation as target. </p>
<dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramname">a</td><td>graph adapter providing the relations</td></tr>
    <tr><td class="paramname">nodes</td><td>nodes to be considered</td></tr>
  </table>
  </dd>
</dl>

<p>Definition at line <a class="el" href="_tree_algorithms_8cs_source.html#l00764">764</a> of file <a class="el" href="_tree_algorithms_8cs_source.html">TreeAlgorithms.cs</a>.</p>

</div>
</div>
<a class="anchor" id="ae409eb2323b5f5d51d555132c769ce5f"></a>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">static void SystemSharp.TreeAlgorithms.TreeOperations.ComputeSuccessorsFromParent&lt; T &gt; </td>
          <td>(</td>
          <td class="paramtype">this IGraphAdapter&lt; T &gt;&#160;</td>
          <td class="paramname"><em>a</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">IEnumerable&lt; T &gt;&#160;</td>
          <td class="paramname"><em>nodes</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">static</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Inverts a parent relation, taking the successor relation as target. </p>
<dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramname">a</td><td>graph adapter providing the relations</td></tr>
    <tr><td class="paramname">nodes</td><td>nodes to be considered</td></tr>
  </table>
  </dd>
</dl>

<p>Definition at line <a class="el" href="_tree_algorithms_8cs_source.html#l00754">754</a> of file <a class="el" href="_tree_algorithms_8cs_source.html">TreeAlgorithms.cs</a>.</p>

</div>
</div>
<a class="anchor" id="a2e624bf3a57ed8622a59cbf5af429c42"></a>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">static void SystemSharp.TreeAlgorithms.TreeOperations.CreateDefaultTempStorage&lt; T &gt; </td>
          <td>(</td>
          <td class="paramtype">this IGraphAdapter&lt; T &gt;&#160;</td>
          <td class="paramname"><em>a</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">IEnumerable&lt; T &gt;&#160;</td>
          <td class="paramname"><em>nodes</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">static</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Creates a new list for each temporary list storage property. </p>
<dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramname">a</td><td>the graph adapter</td></tr>
    <tr><td class="paramname">nodes</td><td>enumeration of nodes whose temporary list storage properties are to be initialized</td></tr>
  </table>
  </dd>
</dl>

<p>Definition at line <a class="el" href="_tree_algorithms_8cs_source.html#l00686">686</a> of file <a class="el" href="_tree_algorithms_8cs_source.html">TreeAlgorithms.cs</a>.</p>

</div>
</div>
<a class="anchor" id="a8a496b0f86e71a02eddbcfe4214c0322"></a>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">static void SystemSharp.TreeAlgorithms.TreeOperations.GetLCATree&lt; T &gt; </td>
          <td>(</td>
          <td class="paramtype">IEnumerable&lt; T &gt;&#160;</td>
          <td class="paramname"><em>nodes</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">IPropMap&lt; T, T &gt;&#160;</td>
          <td class="paramname"><em>prel</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">T&#160;</td>
          <td class="paramname"><em>root</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">IPropMap&lt; T, int &gt;&#160;</td>
          <td class="paramname"><em>porel</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">IPropMap&lt; T, T &gt;&#160;</td>
          <td class="paramname"><em>lprel</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">static</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Computes the lowest common ancestor tree of any set of given nodes. </p>
<dl class="tparams"><dt>Template Parameters</dt><dd>
  <table class="tparams">
    <tr><td class="paramname">T</td><td>The node type</td></tr>
  </table>
  </dd>
</dl>
<dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramname">nodes</td><td>The query set of nodes from which the LCA tree should be computed (&gt;= 2 elements)</td></tr>
    <tr><td class="paramname">prel</td><td>The parent relation: assigns each node to its parent</td></tr>
    <tr><td class="paramname">root</td><td>The root node</td></tr>
    <tr><td class="paramname">rporel</td><td>The index relation: assigns each node to its postorder index</td></tr>
    <tr><td class="paramname">lprel</td><td>The LCA relation (output): assigns each node of the query set to its LCA parent</td></tr>
  </table>
  </dd>
</dl>

<p>Definition at line <a class="el" href="_tree_algorithms_8cs_source.html#l01119">1119</a> of file <a class="el" href="_tree_algorithms_8cs_source.html">TreeAlgorithms.cs</a>.</p>

</div>
</div>
<a class="anchor" id="aaf9124d675ae402b5ae159ee1d9562ca"></a>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">static T [] SystemSharp.TreeAlgorithms.TreeOperations.GetPostOrder&lt; T &gt; </td>
          <td>(</td>
          <td class="paramtype">IPropMap&lt; T, T[]&gt;&#160;</td>
          <td class="paramname"><em>succrel</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">IPropMap&lt; T, int &gt;&#160;</td>
          <td class="paramname"><em>indexMap</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">IList&lt; T &gt;&#160;</td>
          <td class="paramname"><em>nodes</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">T&#160;</td>
          <td class="paramname"><em>start</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">bool&#160;</td>
          <td class="paramname"><em>reverse</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">static</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Performs a depth-first search on the graph and retrieves a post-order sorting. </p>
<dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramname">succrel</td><td>successor relation</td></tr>
    <tr><td class="paramname">indexMap</td><td>index map for receiving the post order indices</td></tr>
    <tr><td class="paramname">nodes</td><td>nodes to consider</td></tr>
    <tr><td class="paramname">start</td><td>start node</td></tr>
    <tr><td class="paramname">reverse</td><td>whether a reverse post-order sorting is desired</td></tr>
  </table>
  </dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>all visited nodes in post-order sorting or inverse post-order sorting</dd></dl>

<p>Definition at line <a class="el" href="_tree_algorithms_8cs_source.html#l00861">861</a> of file <a class="el" href="_tree_algorithms_8cs_source.html">TreeAlgorithms.cs</a>.</p>

</div>
</div>
<a class="anchor" id="ab742b382c2eb84bc70e05072433e88f7"></a>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">static T [] SystemSharp.TreeAlgorithms.TreeOperations.GetPreOrder&lt; T &gt; </td>
          <td>(</td>
          <td class="paramtype">this IGraphAdapter&lt; T &gt;&#160;</td>
          <td class="paramname"><em>a</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">IList&lt; T &gt;&#160;</td>
          <td class="paramname"><em>nodes</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">T&#160;</td>
          <td class="paramname"><em>start</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">static</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Performs a depth-first search on the successor relation, updating the pre-order index and pre-order last index relations of the graph adapter. </p>
<dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramname">a</td><td>graph adapter</td></tr>
    <tr><td class="paramname">nodes</td><td>nodes to be considered</td></tr>
    <tr><td class="paramname">start</td><td>start node</td></tr>
  </table>
  </dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>all visited nodes in pre-order</dd></dl>

<p>Definition at line <a class="el" href="_tree_algorithms_8cs_source.html#l00795">795</a> of file <a class="el" href="_tree_algorithms_8cs_source.html">TreeAlgorithms.cs</a>.</p>

</div>
</div>
<a class="anchor" id="aa1b2c48d35aa188ac914a0096e8e605f"></a>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">static T [] SystemSharp.TreeAlgorithms.TreeOperations.GetPreOrder&lt; T &gt; </td>
          <td>(</td>
          <td class="paramtype">this IGraphAdapter&lt; T &gt;&#160;</td>
          <td class="paramname"><em>a</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">IList&lt; T &gt;&#160;</td>
          <td class="paramname"><em>nodes</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">static</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Performs a depth-first search on the successor relation, updating the pre-order index and pre-order last index relations of the graph adapter. All nodes without parent are taken as start nodes. </p>
<dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramname">a</td><td>graph adapter</td></tr>
    <tr><td class="paramname">nodes</td><td>nodes to be considered</td></tr>
  </table>
  </dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>all visited nodes in pre-order</dd></dl>

<p>Definition at line <a class="el" href="_tree_algorithms_8cs_source.html#l00816">816</a> of file <a class="el" href="_tree_algorithms_8cs_source.html">TreeAlgorithms.cs</a>.</p>

</div>
</div>
<a class="anchor" id="a264e50c23ab43bc5980e80dd9d129d83"></a>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">static void SystemSharp.TreeAlgorithms.TreeOperations.InvertRelation&lt; T &gt; </td>
          <td>(</td>
          <td class="paramtype">this IGraphAdapter&lt; T &gt;&#160;</td>
          <td class="paramname"><em>a</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">IPropMap&lt; T, T &gt;&#160;</td>
          <td class="paramname"><em>srcrel</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">IPropMap&lt; T, T[]&gt;&#160;</td>
          <td class="paramname"><em>dstrel</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">IEnumerable&lt; T &gt;&#160;</td>
          <td class="paramname"><em>nodes</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">static</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Inverts a property map-based relation. </p>
<dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramname">a</td><td>graph adapter providing temporary list storage</td></tr>
    <tr><td class="paramname">srcrel</td><td>source property map</td></tr>
    <tr><td class="paramname">dstrel</td><td>destination property map for inverted relation</td></tr>
    <tr><td class="paramname">nodes</td><td>nodes to be considered for the inversion</td></tr>
  </table>
  </dd>
</dl>

<p>Definition at line <a class="el" href="_tree_algorithms_8cs_source.html#l00702">702</a> of file <a class="el" href="_tree_algorithms_8cs_source.html">TreeAlgorithms.cs</a>.</p>

</div>
</div>
<a class="anchor" id="af536d2d1a3a116676e9fea1ce91d5c22"></a>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">static void SystemSharp.TreeAlgorithms.TreeOperations.InvertRelation&lt; T &gt; </td>
          <td>(</td>
          <td class="paramtype">this IGraphAdapter&lt; T &gt;&#160;</td>
          <td class="paramname"><em>a</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">IPropMap&lt; T, T[]&gt;&#160;</td>
          <td class="paramname"><em>srcrel</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">IPropMap&lt; T, T[]&gt;&#160;</td>
          <td class="paramname"><em>dstrel</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">IEnumerable&lt; T &gt;&#160;</td>
          <td class="paramname"><em>nodes</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">static</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Inverts a property map-based relation. </p>
<dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramname">a</td><td>graph adapter providing temporary list storage</td></tr>
    <tr><td class="paramname">srcrel</td><td>source property map</td></tr>
    <tr><td class="paramname">dstrel</td><td>destination property map for inverted relation</td></tr>
    <tr><td class="paramname">nodes</td><td>nodes to be considered for the inversion</td></tr>
  </table>
  </dd>
</dl>

<p>Definition at line <a class="el" href="_tree_algorithms_8cs_source.html#l00729">729</a> of file <a class="el" href="_tree_algorithms_8cs_source.html">TreeAlgorithms.cs</a>.</p>

</div>
</div>
<a class="anchor" id="a4bd65ffbbadb4eedaae40cec64276ad1"></a>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">static bool SystemSharp.TreeAlgorithms.TreeOperations.IsAncestor&lt; T &gt; </td>
          <td>(</td>
          <td class="paramtype">IPropMap&lt; T, int &gt;&#160;</td>
          <td class="paramname"><em>indexrel</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">IPropMap&lt; T, T &gt;&#160;</td>
          <td class="paramname"><em>lastrel</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">T&#160;</td>
          <td class="paramname"><em>w</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">T&#160;</td>
          <td class="paramname"><em>v</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">static</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Returns <code>true</code> if <em>w</em>  is an ancestor of <code>v</code>. </p>
<dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramname">indexrel</td><td>pre-order index relation</td></tr>
    <tr><td class="paramname">lastrel</td><td>pre-order last index relation</td></tr>
  </table>
  </dd>
</dl>

<p>Definition at line <a class="el" href="_tree_algorithms_8cs_source.html#l00890">890</a> of file <a class="el" href="_tree_algorithms_8cs_source.html">TreeAlgorithms.cs</a>.</p>

</div>
</div>
<a class="anchor" id="accca9c1ccf11f560b1741277be1975f8"></a>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">static bool SystemSharp.TreeAlgorithms.TreeOperations.IsAncestor&lt; T &gt; </td>
          <td>(</td>
          <td class="paramtype">this IGraphAdapter&lt; T &gt;&#160;</td>
          <td class="paramname"><em>a</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">T&#160;</td>
          <td class="paramname"><em>w</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">T&#160;</td>
          <td class="paramname"><em>v</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">static</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Returns <code>true</code> if <em>w</em>  is an ancestor of <code>v</code>. </p>

<p>Definition at line <a class="el" href="_tree_algorithms_8cs_source.html#l00901">901</a> of file <a class="el" href="_tree_algorithms_8cs_source.html">TreeAlgorithms.cs</a>.</p>

</div>
</div>
<a class="anchor" id="ae7b3939ad3b687dd82d33190475e8371"></a>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">static void SystemSharp.TreeAlgorithms.TreeOperations.RequireAccess&lt; TThis, TValue &gt; </td>
          <td>(</td>
          <td class="paramtype">this IPropMap&lt; TThis, TValue &gt;&#160;</td>
          <td class="paramname"><em>pmap</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype"><a class="el" href="namespace_system_sharp_1_1_tree_algorithms.html#a6a1436f9b943edaf1ab43d5a5df6d004">EAccess</a>&#160;</td>
          <td class="paramname"><em>access</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">static</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Checks whether the property map grants the requested access privilege and throws an exception if it doesn't. </p>
<dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramname">access</td><td>required access privilege</td></tr>
  </table>
  </dd>
</dl>
<dl class="exception"><dt>Exceptions</dt><dd>
  <table class="exception">
    <tr><td class="paramname">InvalidOperationException</td><td>if requested access privilege is not supported</td></tr>
  </table>
  </dd>
</dl>

<p>Definition at line <a class="el" href="_tree_algorithms_8cs_source.html#l00623">623</a> of file <a class="el" href="_tree_algorithms_8cs_source.html">TreeAlgorithms.cs</a>.</p>

</div>
</div>
<a class="anchor" id="a1eadc8c2956caf39c9221edfe2dcac07"></a>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">static void SystemSharp.TreeAlgorithms.TreeOperations.Reset&lt; TThis, TValue &gt; </td>
          <td>(</td>
          <td class="paramtype">this IPropMap&lt; TThis, TValue &gt;&#160;</td>
          <td class="paramname"><em>pmap</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">IEnumerable&lt; TThis &gt;&#160;</td>
          <td class="paramname"><em>nodes</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">TValue&#160;</td>
          <td class="paramname"><em>value</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">static</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Sets all specified keys of the property map to the specified reset value. </p>
<dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramname">pmap</td><td>the property map</td></tr>
    <tr><td class="paramname">nodes</td><td>the elements whose property values are to be reset</td></tr>
    <tr><td class="paramname">value</td><td>reset value</td></tr>
  </table>
  </dd>
</dl>

<p>Definition at line <a class="el" href="_tree_algorithms_8cs_source.html#l00660">660</a> of file <a class="el" href="_tree_algorithms_8cs_source.html">TreeAlgorithms.cs</a>.</p>

</div>
</div>
<hr/>The documentation for this class was generated from the following file:<ul>
<li><a class="el" href="_tree_algorithms_8cs_source.html">TreeAlgorithms.cs</a></li>
</ul>
</div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
  <ul>
    <li class="navelem"><a class="el" href="namespace_system_sharp.html">SystemSharp</a></li><li class="navelem"><a class="el" href="namespace_system_sharp_1_1_tree_algorithms.html">TreeAlgorithms</a></li><li class="navelem"><a class="el" href="class_system_sharp_1_1_tree_algorithms_1_1_tree_operations.html">TreeOperations</a></li>
    <li class="footer">Generated on Thu Dec 26 2013 14:22:22 for SystemSharp by
    <a href="http://www.doxygen.org/index.html">
    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.6 </li>
  </ul>
</div>
</body>
</html>
